Description: 本章介绍广泛用于路由协议的基本概念。在这里概述的论题包括路由协议的组成部分和算法。另外,将路由协议的作用与被路由或网络协议的作用作一简短的对比。在第VII部分的章节"路由协议s,"里,会更详细地讲述特殊的路由协议s,而使用路由协议s的网络协议,是在第VI部分,"网络协议s",中讨论。-This article introduces the underlying concepts widely used in routing protocols. Topics summarized here include routing protocol components and algorithms. In addition, the role of routing protocols is briefly contrasted with the role of routed or network protocols.
。
Platform: |
Size: 73728 |
Author:Zhoushenglie |
Hits:
Description: Dijkstra s algorithm, conceived by Dutch computer scientist Edsger Dijkstra in 1956 and published in 1959is a graph search algorithm that solves the single-source shortest path problem for a graph with nonnegative edge path costs, producing a shortest path tree. This algorithm is often used in routing and as a subroutine in other graph algorithms Platform: |
Size: 33792 |
Author:ahmed |
Hits:
Description: 虚拟骨干网，包括佛罗里达大西洋大学的Jie Wu和Hailan Li 提出的关于连通控制集的算法，第二种算法是das等提出的从找到最小近似控制集到建立一个最小生成树的算法，最后一种算法是通过寻找MIS集获得CDS的方法。这三种算法提供了三种建立CDS集的方法，连通控制集（connected dominating set，CDS）作为层次路由协议中的虚拟主干是网络中保证其余节点能顺利通信的关键，它们承受更高的通信和计算负荷，网络的可靠性会因这些关键节点中的某个节点的失效而受影响。-Virtual backbone, including Jie Wu, Florida Atlantic University and Hailan Li on the connected dominating set algorithm, the second algorithm is das, etc. proposed the establishment of a minimum spanning tree algorithm to find the smallest approximate control set to the last onethe algorithm is obtained by finding the MIS set of CDS. Of the three algorithms, three kinds of CDS set, connected dominating sets (connected dominating the set, CDS), as a hierarchical routing protocol in the virtual backbone is the network to ensure that the remaining nodes can successfully communicate key, they are subjected to higher communication and the computational load, the reliability of the network due to the failure of these critical nodes in a node affected. Platform: |
Size: 3449856 |
Author: |
Hits:
Description: This is a graph search algorithm that solves the single-source shortest path problem for a graph with nonnegative edge path costs, producing a shortest path tree. This algorithm is often used in routing and as a subroutine in other graph algorithms. NetBeans project Platform: |
Size: 26624 |
Author:Nastya |
Hits:
Description: Dijkstra s algorithm, conceived by Dutch computer scientist Edsger Dijkstra in 1956 and published in 1959,[1][2] is a graph search algorithm that solves the single-source shortest path problem for a graph with nonnegative edge path costs, producing a shortest path tree. This algorithm is often used in routing and as a subroutine in other graph algorithms. Platform: |
Size: 40960 |
Author:ivan |
Hits:
Description: 本文在阐述网络发展的现状和趋势的基础上，着重分析了两种内
部网关路由选择协议砒P和OSPF协议的实现机制和性能特点。对P
协议是基于距离矢量算法的。OSPF协议是基于链路状态算法的。本
文的工作重点是对上述两种协议分别从类型，封装，路径特征，邻居
发现和支持，路由选择数据的分发，对变化的响应，路由表计算，健
壮性／可靠性以及安全性等方面进行了对比分析，并对它们存在的安
全漏洞进行了初步的分析说明。根据以上的分析，通过On忸T软件，
本文设计了一个10km×10km规模大小的网络仿真模型，配置了相应
的流量和IP地址，并选取了路由协议网络收敛性，协议开销，网络
延时以及链路修复四个仿真性能参数进行仿真，最后通过对仿真结果
的分析得出以下结论：对P协议适合于网络规模较小、拓扑结构比较
简单、性能要求不严格和易用性要求较高的环境，而OSPF则适合于
网络规模大、拓扑结构复杂和性能要求高的环境，因此要根据网络特
点合理的选择路由协议。-This paper described the status and trends of network development on the basis of analyzes of two
Ministry gateway routing select the protocol arsenic P and OSPF protocol implementation mechanism and performance characteristics. P
The protocol is based on the distance vector algorithm. The OSPF protocol is based on link-state algorithms. This
The text s focus is on these two agreements, respectively, from the type of package, the path characteristics, neighbors
Discovery and route choice of data distribution, changes in response, the routing table calculation, and health
Zhuang/reliability, and security aspects of a comparative analysis, and they are safety
The full loopholes in the preliminary analysis shows. According to the above analysis, On to blush T software
Designed a 10km x 10km scale the size of the network simulation model, configuration, corresponding
Traffic and IP address, and select the routing protocol convergence, protocol overhead, network
Delay and link repa Platform: |
Size: 9182208 |
Author:哲 |
Hits:
Description: Zone Routing Protocol (ZRP) is a most promising and widely accepted and well proved hybrid routing
protocol in Mobile Ad-hoc Networks (MANETs) for its performance when compared with table-driven and
on-demand protocols. Our study is based on using the concept of genetic algorithms to provide a set of
available paths to the destination in order to load balance the network. This gives us the reduction in
overhead and better delivery of packets. We call this new routing protocol as Genetic Zone Routing
Protocol (GZRP). Platform: |
Size: 119808 |
Author:Nguyen Kim Thuan |
Hits:
Description: 具体介绍了RWA问题的相关概念及常见算法，对静态网络情况下的路由和波长分配问题进行了深入研究-Specific RWA problem related concepts and common algorithms, conducted in-depth study on the routing and wavelength assignment problem in the case of static network Platform: |
Size: 51200 |
Author:郭玲 |
Hits:
Description: Wireless Mesh Networks (WMNs) are a promising technology
for providing broadband wireless access to the end
user. They offer a higher degree of flexibility compared to
traditional networks but on the expense of a more complex
structure. Thus, planning and optimization of WMNs is a
challenge. In this paper, we address this challenge using
genetic algorithms. Genetic algorithms are able to evaluate
and optimize large-scale WMNs in relatively small computation
time. The results prove the effectiveness of the genetic
operators to optimize the routing and channel assignment in
WMNs. Platform: |
Size: 212992 |
Author:SALAH |
Hits:
Description: The project “NETWORK LOAD BALANCING” is designed
using Microsoft Visual Studio.Net 2008 as front end and Microsoft SQL Server 2005 as back end which works in .Net framework version 2.0. The coding language used is VB .Net.
Many distributed real-time applications, such as audio- and video-conferencing, require the network to construct a multicast path (tree) from a sender to multiple receivers. Furthermore, real-time applications have Quality-of-Service (QoS) requirements (e.g. bandwidth). The objective of the routing protocol is to build a tree that is both feasible (i.e. satisfies the requested QoS) and least costly. The cost of a tree depends on the costs of its links. The cost of a link should reflect the effect of allocating resources to the new connection on existing and future connections. Many studies have proposed multicast algorithms to construct low-cost QoS-constrained trees.-The project “NETWORK LOAD BALANCING” is designed
using Microsoft Visual Studio.Net 2008 as front end and Microsoft SQL Server 2005 as back end which works in .Net framework version 2.0. The coding language used is VB .Net.
Many distributed real-time applications, such as audio- and video-conferencing, require the network to construct a multicast path (tree) from a sender to multiple receivers. Furthermore, real-time applications have Quality-of-Service (QoS) requirements (e.g. bandwidth). The objective of the routing protocol is to build a tree that is both feasible (i.e. satisfies the requested QoS) and least costly. The cost of a tree depends on the costs of its links. The cost of a link should reflect the effect of allocating resources to the new connection on existing and future connections. Many studies have proposed multicast algorithms to construct low-cost QoS-constrained trees. Platform: |
Size: 561152 |
Author:Starlin T S |
Hits:
Description: 这是基于matlab的通过遗传算法解决物流配送车辆路径问题-This is based on matlab by genetic algorithms to solve the logistics distribution vehicle routing problem Platform: |
Size: 20480 |
Author: |
Hits:
Description: 该文章详细描述了移动机器人在目标追踪和路径选择中的几种算法及仿真实验。-The article describes in detail the mobile robot to chase the target article describes in detail the mobile robot in the target tracking and routing of several algorithms and simulation experiments. Tracking and routing of several algorithms and simulation experiments. Platform: |
Size: 231424 |
Author:baiyijushi |
Hits:
Search - routing algorithms